An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift
نویسندگان
چکیده
(First draft March 2005; revised November 2005) Abstract This paper extends some adaptive schemes that have been developed for the Random Walk Metropolis algorithm to more general versions of the Metropolis-Hastings (MH) algorithm, particularly to the Metropolis Adjusted Langevin algorithm of Roberts and Tweedie (1996). Our simulations show that the adaptation drastically improves the performance of such MH algorithms. We study the convergence of the algorithm. Our proves are based on a new approach to the analysis of stochastic approximation algorithms based on mixingales theory.
منابع مشابه
Limit Theorems for Some Adaptive Mcmc Algorithms with Subgeometric Kernels: Part Ii
We prove a central limit theorem for a general class of adaptive Markov Chain Monte Carlo algorithms driven by sub-geometrically ergodic Markov kernels. We discuss in detail the special case of stochastic approximation. We use the result to analyze the asymptotic behavior of an adaptive version of the Metropolis Adjusted Langevin algorithm with a heavy tailed target density.
متن کاملExploring an Adaptive Metropolis Algorithm
While adaptive methods for MCMC are under active development, their utility has been under-recognized. We briefly review some theoretical results relevant to adaptive MCMC. We then suggest a very simple and effective algorithm to adapt proposal densities for random walk Metropolis and Metropolis adjusted Langevin algorithms. The benefits of this algorithm are immediate, and we demonstrate its p...
متن کاملComplexity bounds for Markov chain Monte Carlo algorithms via diffusion limits
We connect known results about diffusion limits of Markov chain Monte Carlo (MCMC) algorithms to the computer science notion of algorithm complexity. Ourmain result states that any weak limit of a Markov process implies a corresponding complexity bound (in an appropriate metric). We then combine this result with previously-known MCMC diffusion limit results to prove that under appropriate assum...
متن کاملComplexity Bounds for MCMC via Diffusion Limits
We connect known results about diffusion limits of Markov chain Monte Carlo (MCMC) algorithms to the Computer Science notion of algorithm complexity. Our main result states that any diffusion limit of a Markov process implies a corresponding complexity bound (in an appropriate metric). We then combine this result with previously-known MCMC diffusion limit results to prove that under appropriate...
متن کاملOptimal Scaling of the Mala Algorithm with Irreversible Proposals for Gaussian Targets
Abstract. It is known that reversible Langevin diffusions in confining potentials converge to equilibrium exponentially fast. Adding a divergence free component to the drift of a Langevin diffusion accelerates its convergence to stationarity. However such a stochastic differential equation (SDE) is no longer reversible. In this paper, we analyze the optimal scaling of MCMC algorithms constructe...
متن کامل